-
1 combinatorial programming
Большой англо-русский и русско-английский словарь > combinatorial programming
-
2 combinatorial programming
Математика: комбинаторное программированиеУниверсальный англо-русский словарь > combinatorial programming
-
3 combinatorial programming
English-Russian scientific dictionary > combinatorial programming
-
4 programming
2) планирование• -
5 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
6 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system -
7 algorithm
-
ad hoc algorithm
-
adaptive algorithm
-
aim algorithm
-
best-route algorithm
-
branch-and-bound algorithm
-
branching algorithm
-
chain algorithm
-
coding algorithm
-
collision fronts algorithm
-
combinatorial algorithm
-
computational algorithm
-
construction algorithms
- contour following algorithm -
contour matching algorithm
-
control algorithm
-
curve-fitting algorithm
-
decoding algorithm
-
division algorithm
-
docking algorithm
-
edge-tracking algorithm
-
Euclidian algorithm
-
exact embedding algorithm
-
exchange algorithm
-
generalized algorithm
-
greedy algorithm
-
hardware algorithm
-
image understanding algorithm
-
itention algorithm
-
layout algorithm
-
learning algorithm
-
logical algorithm
-
logic algorithm
-
look-ahead control algorithm
-
LOS approach algorithm
-
min-cut algorithm
-
modeling algorithm
-
Monte-Carlo algorithm
-
numerical algorithm
-
obstacle-avoidance algorithm
-
operating algorithm
-
ordering algorithm
-
paging algorithm
-
partitioning algorithm
-
pattern generation algorithm
-
placement algorithm
-
prediction algorithm
-
probabalistic algorithm
-
problem algorithm
-
programming algorithm
-
random-search algorithm
-
recognition algorithm
-
recursive algorithm
-
rendezvous algorithm
-
routing algorithm
-
scheduling algorithm
-
shortest path algorithm
-
shrinking algorithm
-
simplex algorithm
-
software algorithm
-
sorting algorithm
-
stack algorithm
-
steering algorithm
-
stochastic algorithm
-
testing algorithm
-
transportation algorithm
-
tree-search algorithm
-
velocity compensated algorithm
-
vision algorithm
-
wiring algorithm -
8 language
- absolutely homogeneous language - absolutely inadequate language - absolutely nonhomogeneous language - absolutely nonperfect language - absolutely nonsimple language - absolutely perfect language - absolutely simple language - completely formalized language - completely homogeneous language - left categorial language - locally perfectly adequate language - locally simple language - locally strongly language - locally well adequate language - noncompletely homogeneous language - right categorial language - scattered context languageindistinguishable in the language — лог. неразличимый на языке, эквивалентный
-
9 model
1) макет; модель || моделировать2) образец4) модель, тип ( изделия)5) шаблон•- countably saturated model - countably uniform model - coupled channels model - finite state model - finitely generated model - game-theory model - random trial increment model - random walk model - sampling model -
10 technique
См. также в других словарях:
Combinatorial data analysis — (CDA) is the study of data sets where the arrangement of objects is important. CDA can be used either to determine how well a given combinatorial construct reflects the observed data, or to search for a suitable combinatorial construct that does… … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Combinatorial number system — In mathematics, and in particular in combinatorics, the combinatorial number system of degree k (for some positive integer k), also referred to as combinadics, is a correspondence between natural numbers (taken to include 0) N and k… … Wikipedia
Combinatorial auction — A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages,” rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
List of programming languages by category — Programming language lists Alphabetical Categorical Chronological Generational This is a list of programming languages grouped by category. Some languages are listed in multiple categories. Contents … Wikipedia
Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
The Art of Computer Programming — [ [http://www cs faculty.stanford.edu/ uno/taocp.html The Art of Computer Programming ] ] is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis. Knuth began the project, which was … Wikipedia
Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… … Wikipedia
Comet (programming language) — Comet is an object oriented programming language used to solve complex combinatorial optimization problems in areas such as resource allocation and scheduling. It offers a wide range of optimization algorithms: from mathematical programming to… … Wikipedia